220 research outputs found

    Color the cycles

    Get PDF
    The cycles of length k in a complete graph on n vertices are colored in such a way that edge-disjoint cycles get distinct colors. The minimum number of colors is asymptotically determined. © 2013

    Az entomológus Dr. Szent-Ivány József (1910–1988) tíz éve a Magyar Nemzeti Múzeumban

    Get PDF

    Multiply intersecting families of sets

    Get PDF
    AbstractLet [n] denote the set {1,2,…,n}, 2[n] the collection of all subsets of [n] and F⊂2[n] be a family. The maximum of |F| is studied if any r subsets have an at least s-element intersection and there are no ℓ subsets containing t+1 common elements. We show that |F|⩽∑i=0t−sn−si+t+ℓ−st+2−sn−st+1−s+ℓ−2 and this bound is asymptotically the best possible as n→∞ and t⩾2s⩾2, r,ℓ⩾2 are fixed

    Butterfly and skipper records from Lebanon (Lepidoptera: Papilionoidea)

    Get PDF
    Eighty-five specimens of 30 papilionoid species have been collected in Lebanon during entomological expeditions launched in 2015 and 2016 by the joint project of the Hungarian Natural History Museum and the Holy Spirit University of Kaslik. Th e collecting sites and events are listed, and the species annotated. With 23 figures
    • …
    corecore